Uniprocessor EDF Scheduling with Mode Change
نویسنده
چکیده
Consider the problem of scheduling sporadically-arriving tasks with implicit deadlines using Earliest-Deadline-First (EDF) on a single processor. The system may undergo changes in its operational modes and therefore the characteristics of the task set may change at run-time. We consider a well-established previously published mode-change protocol by Sha et al. and we show that if every mode utilizes at most 50% of the processing capacity then all deadlines are met. We also show that there exists a task set that misses a deadline although the utilization exceeds 50% by just an arbitrarily small amount. Finally, we present, for a relevant special case, an exact schedulability test for EDF with mode change. Uniprocessor EDF Scheduling with Mode Change Björn Andersson IPP Hurray Research Group, Polytechnic Institute of Porto, Portugal Abstract. Consider the problem of scheduling sporadically-arriving tasks with implicit deadlines using Earliest-Deadline-First (EDF) on a single processor. The system may undergo changes in its operational modes and therefore the characteristics of the task set may change at run-time. We consider a well-established previously published mode-change protocol by Sha et al. and we show that if every mode utilizes at most 50% of the processing capacity then all deadlines are met. We also show that there exists a task set that misses a deadline although the utilization exceeds 50% by just an arbitrarily small amount. Finally, we present, for a relevant special case, an exact schedulability test for EDF with mode change. Consider the problem of scheduling sporadically-arriving tasks with implicit deadlines using Earliest-Deadline-First (EDF) on a single processor. The system may undergo changes in its operational modes and therefore the characteristics of the task set may change at run-time. We consider a well-established previously published mode-change protocol by Sha et al. and we show that if every mode utilizes at most 50% of the processing capacity then all deadlines are met. We also show that there exists a task set that misses a deadline although the utilization exceeds 50% by just an arbitrarily small amount. Finally, we present, for a relevant special case, an exact schedulability test for EDF with mode change.
منابع مشابه
Preemptive uniprocessor scheduling for mixed-criticality systems
In this paper we implement the EDF-VD (Earliest Deadline First with Virtual Deadline) algorithm described in [1] for scheduling mixed-criticality, realtime task systems on preemptive uniprocessor platforms. We compare the scheduling overheads of this algorithm with the scheduling overheads of the well known EDF (Earliest Deadline First) algorithm for scheduling realtime task systems on preempti...
متن کاملTie-breaking for EDF on multiprocessor platforms
Scheduling real-time systems on multiprocessors introduces complexities that do not arise when using uniprocessors. When scheduling using EDF on multiprocessor platforms, breaking deadline ties in different ways can change the resulting schedule dramatically. We consider methods to resolve the ambiguities in EDF priorities due to coincident deadlines. We show that no optimal ambiguity solver ca...
متن کاملState-Based Mode Switching with Applications to Mixed-Criticality Systems
We present a new graph-based real-time task model that can specify complex job arrival patterns and global statebased mode switching. The mode switching is of a mixedcriticality style, enabling immediate changes to the parameters of active jobs upon mode switches. The resulting task model therefore generalizes previously proposed task graph models as well as mixed-criticality (sporadic) task mo...
متن کاملQuantifying the sub-optimality of uniprocessor fixed-priority scheduling∗
There are sporadic task systems schedulable by EDF, which no fixed-priority (FP) algorithm can schedule successfully. For instance, it is known that while all implicit-deadline sporadic task systems with utilization at most one are EDF-schedulable on a unit-capacity uniprocessor, there are implicit-deadline sporadic task systems that are not schedulable by any FP algorithm, and have utilization...
متن کاملSchedulability Test for Soft Real-Time Systems under Multiprocessor Environment by using an Earliest Deadline First Scheduling Algorithm
This paper deals with the study of Earliest Deadline First (EDF) which is an optimal scheduling algorithm for uniprocessor real time systems use for scheduling the periodic task in soft real-time multiprocessor systems. In hard real-time systems, a significant disparity exists EDF-based schemes and RMA scheduling (which is the only known way of optimally scheduling recurrent real-time tasks on ...
متن کامل